Towards fresh re-keying with leakage-resilient PRFs: cipher design principles and analysis
نویسندگان
چکیده
منابع مشابه
Leakage-Resilient Symmetric Encryption via Re-keying
In the paper, we study whether it is possible to construct an efficient leakage-resilient symmetric scheme using the AES block cipher. We aim at bridging the gap between the theoretical leakage-resilient symmetric primitives used to build encryption schemes and the practical schemes that do not have any security proof against side-channel adversaries. Our goal is to construct an as efficient as...
متن کاملOn Making U2F Protocol Leakage-Resilient via Re-keying
The Universal 2nd Factor (U2F) protocol is an open authentication standard to strengthen the two-factor authentication process. It augments the existing password based infrastructure by using a specialized USB, termed as the U2F authenticator, as the 2nd factor. The U2F authenticator is assigned two fixed keys at the time of manufacture, namely the device secret key and the attestation private ...
متن کاملTowards Sound Fresh Re-keying with Hard (Physical) Learning Problems
Most leakage-resilient cryptographic constructions aim at limiting the information adversaries can obtain about secret keys. In the case of asymmetric algorithms, this is usually obtained by secret sharing (aka masking) the key, which is made easy by their algebraic properties. In the case of symmetric algorithms, it is rather key evolution that is exploited. While more efficient, the scope of ...
متن کاملTowards Super-Exponential Side-Channel Security with Efficient Leakage-Resilient PRFs
Leakage-resilient constructions have attracted significant attention over the last couple of years. In practice, pseudorandom functions are among the most important such primitives, because they are stateless and do not require a secure initialization as, e.g. stream ciphers. However, their deployment in actual applications is still limited by security and efficiency concerns. This paper contri...
متن کاملCombining Leakage-Resilient PRFs and Shuffling - Towards Bounded Security for Small Embedded Devices
Combining countermeasures is usually assumed to be the best way to protect embedded devices against side-channel attacks. These combinations are at least expected to increase the number of measurements of successful attacks to some reasonable extent, and at best to guarantee a bounded time complexity independent of the number of measurements. This latter guarantee, only possible in the context ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptographic Engineering
سال: 2014
ISSN: 2190-8508,2190-8516
DOI: 10.1007/s13389-014-0079-5